Involution Binary Relations ∗
نویسندگان
چکیده
This paper aims to investigate properties of strictly involution binary relations, which are generalizations of the classical notions of binary relations. We study the concepts of involution spanning subsets and give some examples related to different involution binary relations. Moreover, the involution independence with code is also considered in this paper.
منابع مشابه
Two-boundary lattice paths and parking functions
We describe an involution on a set of sequences associated with lattice paths with north or east steps constrained to lie between two arbitrary boundaries. This involution yields recursions (from which determinantal formulas can be derived) for the number and area enumerator of such paths. An analogous involution can be defined for parking functions with arbitrary lower and upper bounds. From t...
متن کاملBijective Proofs of Identities from Colored Binary Trees
In this note, we give a parity reversing involution on colored binary trees which leads to a combinatorial interpretation of Formula (1.2). We make a simple variation of the bijection between colored ternary trees and binary trees proposed by Sun [2] and find a correspondence between certain class of binary trees and the set of colored 5-ary trees. The generalization of the parity reversing inv...
متن کاملLattices and semilattices having an antitone involution in every upper interval
We study ∨-semilattices and lattices with the greatest element 1 where every interval [p,1] is a lattice with an antitone involution. We characterize these semilattices by means of an induced binary operation, the so called sectionally antitone involution. This characterization is done by means of identities, thus the classes of these semilattices or lattices form varieties. The congruence prop...
متن کاملInvolutions Of Connected Binary Matroids
We prove that if an involution φ is an automorphism of a connected binary matroid M , then there is a hyperplane of M that is invariant under φ. We also consider extensions of this result for higher connectivity.
متن کاملFinite Integral Relation Algebras
The method of forming complex algebras of finite ternary relations will produce all finite nonassociative relation algebras. We use this method to construct many interesting algebras. Every atomic NA determines an involution on atoms, which in turn determines both the cycles of the algebra and also the missing, or forbidden cycles. So we begin by studying the cycles of an arbitrary involution. ...
متن کامل